Infinite matching theory

Instrument dependency of Kubelka-Munk theory in computer color matching

Different industries are usually faced with computer color matching as an important problem. The most famous formula which is commonly used for recipe prediction is based on Kubelka-Munk K-M theory. Considering that spectrophotometer’s geometry and its situation influence the measured spectral values, the performance of this method can be affected by the instrument. In the present study, three ...

Infinite Group Theory 2015

s Prof. Paul Baginski Title: Definability and Nilpotence in Groups with Bounded Chains of Centralizers Abstract: A group G has bounded chains of centralizers (G is MC) if every chain of centralizers CG(A1) ≤ CG(A2) ≤ . . . is finite. While this class of groups is interesting in its own right, within the field of logic known as model theory, MC groups have been examined because they strictly con...

Extremal infinite graph theory

We survey various aspects of infinite extremal graph theory and prove several new results. The lead role play the parameters connectivity and degree. This includes the end degree. Many open problems are suggested.

Infinite Galois Theory

Semi-Infinite Theory

In this seminar, we shall introduce semi-infinite manifolds and show how one may define cohomology theories dependent on this semiinfinite structure. In particular, we shall define a de Rham theory. With certain alterations, this is calculable for Wiener manifolds. The goal, however, is to calculate the theory for loop spaces and this is, as yet, an unsolved problem. 1 Semi-Infinite Theory The ...